Uniform multi-hop all-to-all optical routings in rings
نویسندگان
چکیده
منابع مشابه
Uniform Multi - hop All - to - All Optical
We consider all-to-all routing problem in an optical ring network that uses the wavelength-division multiplexing (WDM). Since one-hop, all-to-all optical routing in a WDM optical ring of n nodes needs ! w (Cn; IA; 1) = d 1 2 b n 2 4 ce wavelengths which can be too large even for moderate values of n, we consider in this paper j-hop implementations of all-to-all routing in a WDM optical ring, j ...
متن کاملMulti-hop all-to-all optical routings in Cartesian product networks
This paper considers the wavelength assignment problem for Cartesian product networks with multi-hops. An upper bound of the (uniform) wavelength index for Cartesian product networks with single-hop is established. This result leads to a consequence for the nth power of an arbitrary network with k-hops. In particular, if k = 1, this bound partially generalizes the results of Pankaj [R.K. Pankaj...
متن کاملWavelength routing of uniform instances in all-optical rings
We consider the problem of routing uniform communication instances in switched optical rings that use wavelength-division multiplexing technology. A communication instance is called uniform if it consists exactly of all pairs of nodes in the graph whose distance is equal to one from a specified set S={d1, d2, . . . , dk}.When k=1 or 2, we prove necessary and sufficient conditions on the values ...
متن کاملPermutation Communication in All-Optical Rings
Received (received date) Revised (revised date) Communicated by (Name of Editor) ABSTRACT We study the wavelength problem and arc (edge) congestion problem for communicating permutation instances on a ring. We prove the best possible upper bounds on the number of wavelengths and arc (edge) congestion in both directed and undirected cases.
متن کاملOn permutation communications in all-optical rings
We study the wavelength problem and arc (edge) congestion problem for communicating permutation instances on a ring. We show that the numbers of wavelengths in the directed case ? ! w , in the undirected case w, and the arc congestion ? ! and the edge congestion for a permutation instance I 1 on an n-vertex ring C n satisfy:
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00649-7